enumeration of binary tree

enumeration of binary tree
n.二叉树枚举

English-Chinese dictionary of mining (英汉矿业大词典). 2013.

Игры ⚽ Нужно сделать НИР?

Look at other dictionaries:

  • Binary tree — Not to be confused with B tree. A simple binary tree of size 9 and height 3, with a root node whose value is 2. The above tree is unbalanced and not sorted. In computer science, a binary tree is a tree data structure in which each node has at… …   Wikipedia

  • Tree (graph theory) — Trees A labeled tree with 6 vertices and 5 edges Vertices v Edges v 1 Chromatic number …   Wikipedia

  • Catalan number — For names of numbers in Catalan, see List of numbers in various languages#Occitano Romance. In combinatorial mathematics, the Catalan numbers form a sequence of natural numbers that occur in various counting problems, often involving recursively… …   Wikipedia

  • Bernoulli number — In mathematics, the Bernoulli numbers Bn are a sequence of rational numbers with deep connections to number theory. They are closely related to the values of the Riemann zeta function at negative integers. There are several conventions for… …   Wikipedia

  • 1-Wire — An iButton in a plastic fob, as used for Istanbul Akbil smart ticket 1 Wire is a device communications bus system designed by Dallas Semiconductor Corp. that provides low speed data, signaling, and power over a single signal.[1] 1 Wire is similar …   Wikipedia

  • Lagrange inversion theorem — In mathematical analysis, the Lagrange inversion theorem, also known as the Lagrange Bürmann formula, gives the Taylor series expansion of the inverse function of an analytic function. Theorem statementSuppose the dependence between the variables …   Wikipedia

  • Wedderburn-Etherington number — In graph theory, the Wedderburn Etherington numbers count how many weakly binary trees can be constructed: that is, the number of trees for which each graph vertex (not counting the root) is adjacent to no more than three other such vertices, for …   Wikipedia

  • Theory of conjoint measurement — The theory of conjoint measurement (also known as conjoint measurement or additive conjoint measurement) is a general, formal theory of continuous quantity. It was independently discovered by the French economist Gerard Debreu (1960) and by the… …   Wikipedia

  • Directed acyclic graph — An example of a directed acyclic graph In mathematics and computer science, a directed acyclic graph (DAG i …   Wikipedia

  • Windows Registry — The Windows Registry is a hierarchical database that stores configuration settings and options on Microsoft Windows operating systems. It contains settings for low level operating system components as well as the applications running on the… …   Wikipedia

  • First-order logic — is a formal logical system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first order predicate calculus, the lower predicate calculus, quantification theory, and predicate logic (a less… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”